On the capacity region of a discrete two-user channel for strong interference (Corresp.)

T. M. Cover, “Broadcast channels,” IEEE Tram. Inform. Themy, vol. IT-IS, pp. 2-14, Jan. 1972. P. P. Bergmans, “Random coding theorem for broadcast channels with degraded components,” IEEE Tram. Inform. Theory, vol. IT-19, pp. 197-207, Mar. 1973. E. C. Van Der Meulen, “Random coding theorems for the general discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 180-190, Mar. 1975. See also T. M. Cover, “An achievable rate region for the broadcast channel,” IEEE Tnzm. Inform. Themy, vol. IT-21, pp. 399-404, July 1975. A. D. Wyner, “A theorem on the entropy of certain binary sequences and applications: Part II,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 772-777, Nov. 1973. R. G. Gallager, “Capacity and coding for degraded broadcast channels,” Problems in the Tran.mission of Information, vol. 10, No. 3, pp. 3-14, July-Sept. 1974. -, Information Theory and Reliable Communicat ion. New York: Wiley, 1968.